Density-Based Subspace Clustering in Heterogeneous Networks
نویسندگان
چکیده
Many real-world data sets, like data from social media or bibliographic data, can be represented as heterogeneous networks with several vertex types. Often additional attributes are available for the vertices, such as keywords for a paper. Clustering vertices in such networks, and analyzing the complex interactions between clusters of different types, can provide useful insights into the structure of the data. To exploit the full information content of the data, clustering approaches should consider the connections in the network as well as the vertex attributes. We propose the density-based clustering model TCSC for the detection of clusters in heterogeneous networks that are densely connected in the network as well as in the attribute space. Unlike previous approaches for clustering heterogeneous networks, TCSC enables the detection of clusters that show similarity only in a subset of the attributes, which is more effective in the presence of a large number of attributes.
منابع مشابه
An Efficient and Fast Density Conscious Subspace Clustering using Affinity Propagation
Subspace clustering is an eminent task to detect the clusters in subspaces. Density-based approaches assume the high-density region in the subspace as a cluster, but it creates density divergence problem. The proposed work improves the performance of Density Conscious subspace clustering (DENCOS) by utilizing the Affinity Propagation (AP) algorithm to detect the local densities for a dataset. I...
متن کاملISC–Intelligent Subspace Clustering, A Density Based Clustering Approach for High Dimensional Dataset
Many real-world data sets consist of a very high dimensional feature space. Most clustering techniques use the distance or similarity between objects as a measure to build clusters. But in high dimensional spaces, distances between points become relatively uniform. In such cases, density based approaches may give better results. Subspace Clustering algorithms automatically identify lower dimens...
متن کاملAn Efficient Density Conscious Subspace Clustering Method using Top-down and Bottom-up Strategies
Clustering high dimensional data is an emerging research field. Most clustering technique use distance measures to build clusters. In high dimensional spaces, traditional clustering algorithms suffers from a problem called “curse of dimensionality”. Subspace clustering groups similar objects embedded in subspace of full space. Recent approaches attempt to find clusters embedded in subspace of h...
متن کاملClustering for High Dimensional Data: Density based Subspace Clustering Algorithms
Finding clusters in high dimensional data is a challenging task as the high dimensional data comprises hundreds of attributes. Subspace clustering is an evolving methodology which, instead of finding clusters in the entire feature space, it aims at finding clusters in various overlapping or non-overlapping subspaces of the high dimensional dataset. Density based subspace clustering algorithms t...
متن کاملA Density-based Energy-efficient Clustering Heterogeneous Algorithm for Wireless Sensor Networks
Clustering is an efficient method adopted in various routing algorithms for wireless sensor networks. However, most clustering algorithms are not suitable for heterogeneous networks. In this paper, we propose a Density-based Energy-efficient Clustering Heterogeneous Algorithm (DECHA). In DECHA, we define the density of a node and together with its energy condition to adjust the probability for ...
متن کامل